A converse bound on Wyner-Ahlswede-Körner Network via Gray-Wyner network
نویسنده
چکیده
We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-Körner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network.
منابع مشابه
Information Theoretic Security for Side-Channel Attacks to the Shannon Cipher System
We study side-channel attacks for the Shannon cipher system. To pose side channel-attacks to the Shannon cipher system, we regard them as a signal estimation via encoded data from two distributed sensors. This can be formulated as the one helper source coding problem posed and investigated by Ahlswede, Körner(1975), and Wyner(1975). We further investigate the posed problem to derive new secrecy...
متن کاملSecond-Order Region for Gray-Wyner Network
The coding problem over the Gray-Wyner network is studied from the second-order coding rates perspective. A tilted information density for this network is introduced in the spirit of Kostina-Verdú, and, under a certain regularity condition, the second-order region is characterized in terms of the variance of this tilted information density and the tangent vector of the first-order region. The s...
متن کاملA new dual to the Gács-Körner common information defined via the Gray-Wyner system
We consider jointly distributed random variables X and Y. After describing the Gács-Körner common information between the random variables from the viewpoint of the capacity region of the Gray-Wyner system, we propose a new notion of common information between the random variables that is dual to the Gács-Körner common information, from this viewpoint, in a well-defined sense. We characterize t...
متن کاملDiscrete Lossy Gray-Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations
In this paper, we revisit the discrete lossy Gray-Wyner problem. In particular, we derive its optimal second-order coding rate region, its error exponent (reliability function) and its moderate deviations constant under mild conditions on the source. To obtain the second-order asymptotics, we leverage the properties of an appropriate generalization of the conditional distortion-tilted informati...
متن کاملUnified Theory of Source Coding: Part II -- Multiterminal Problems
In the first paper of this two part communication, we solved in a unified framework a variety of two terminal source coding problems with noncooperative encoders, thereby consolidating works of Shannon, Slepian-Wolf, Wyner, Ahlswede-Körner, Wyner-Ziv, Berger et al. and Berger-Yeung. To achieve such unification we made use of a fundamental principle that dissociates bulk of the analysis from the...
متن کامل